From Intuitionistic Logic to Gödel-Dummett Logic via Parallel Dialogue Games
نویسندگان
چکیده
Building on a version of Lorenzen’s dialogue foundation for intuitionistic logic, we show that Gödel-Dummett logic G can be characterized by a suitable game of communicating parallel dialogues. This provides a computational interpretation of Avron’s hypersequent calculus for G.
منابع مشابه
Truth Values and Connectives in Some Non-Classical Logics
The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...
متن کاملA Hypersequent System for Gödel-Dummett Logic with Non-constant Domains
Gödel-Dummett logic is an extension of first-order intuitionistic logic with the linearity axiom (A ⊃ B)∨ (B ⊃ A), and the so-called “quantifier shift” axiom ∀x(A ∨ B(x)) ⊃ A ∨ ∀xB(x). Semantically, it can be characterised as a logic for linear Kripke frames with constant domains. Gödel-Dummett logic has a natural formalisation in hypersequent calculus. However, if one drops the quantifier shif...
متن کاملDecidability of Quantified Propositional Intuitionistic Logic and S4 on Trees of Height and Arity ≤ω
Quantified propositional intuitionistic logic is obtained from propositional intuitionistic logic by adding quantifiers ∀p, ∃p, where the propositional variables range over upward-closed subsets of the set of worlds in a Kripke structure. If the permitted accessibility relations are arbitrary partial orders, the resulting logic is known to be recursively isomorphic to full second-order logic (K...
متن کاملParallel Dialogue Games and Hypersequents for Intermediate Logics
A parallel version of Lorenzen’s dialogue theoretic foundation for intuitionistic logic is shown to be adequate for a number of important intermediate logics. The soundness and completeness proofs proceed by relating hypersequent derivations to winning strategies for parallel dialogue games. This also provides a computational interpretation of hypersequents.
متن کاملNote on inter-expressibility of logical connectives in finitely-valued Gödel-Dummett logics
Let Gm be the m-valued Gödel-Dummett fuzzy logic. If m ≥ 3 then neither conjunction nor implication is in Gm expressible in terms of the remaining connectives. This fact remains true even if the propositional language is enriched by propositional constants for all truth values. Gödel-Dummett fuzzy propositional logic can be defined as an extension of the intuitionistic propositional logic by th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003